منابع مشابه
Unfolding feasible arithmetic and weak truth
In this paper we continue Feferman’s unfolding program initiated in [11] which uses the concept of the unfolding U(S) of a schematic system S in order to describe those operations, predicates and principles concerning them, which are implicit in the acceptance of S. The program has been carried through for a schematic system of non-finitist arithmetic NFA in Feferman and Strahm [13] and for a s...
متن کاملSyntactical Truth Predicates For Second Order Arithmetic
We introduce a notion of syntactical truth predicate (s.t.p.) for the second order arithmetic PA. An s.t.p. is a set T of closed formulas such that: i) T (t = u) iff the closed first order terms t and u are convertible, i.e. have the same value in the standard interpretation ii) T (A → B) iff (T (A) ⇒ T (B)) iii) T (∀xA) iff (T (A[x ← t]) for any closed first order term t) iv) T (∀XA) iff (T (A...
متن کاملOn Wright’s Inductive Definition of Coherence Truth for Arithmetic
As the first illustration of a potential satisfier for the ‘platitudes for truth’ in the appendix to his engaging recent discussion of the concept of truth (Wright 1999), Crispin Wright has proposed a notion of ‘truth conceived as coherence’ for arithmetic. This paper attempts to clarify certain aspects of Wright’s proposal. Take the standard first-order language of arithmetic L. Let B be some ...
متن کاملRole Clarity , Need for Clarity , Satisfaction , Tension , and Withdrawal 1
In a mailed-questionnaire study of 156 staff registered nurses, perceived role clarity was related negatively to voluntary turnover, propensity to leave, and job tension, and positively to work satisfaction. The correlations of role clarity with voluntary turnover, propensity to leave, and work satisfaction were nonsignificant for nurses classified as low on a need-for-clarity index; the correl...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer
سال: 2003
ISSN: 0018-9162
DOI: 10.1109/mc.2003.1178060